Network Models for Multiobjective Discrete Optimization

نویسندگان

چکیده

This paper provides a novel framework for solving multiobjective discrete optimization problems with an arbitrary number of objectives. Our represents these as network models, in that enumerating the Pareto frontier amounts to multicriteria shortest-path problem auxiliary network. We design techniques exploiting models order accelerate identification frontier, most notably operations simplify by removing nodes and arcs while preserving set nondominated solutions. show proposed yields orders-of-magnitude performance improvements over existing state-of-the-art algorithms on five classes containing both linear nonlinear objective functions. Summary Contribution: Multiobjective has long history research applications several domains. alternative modeling solution approach leveraging graphical structures. Specifically, we encode decision space layered propose graph reduction operators preserve only solutions whose image are part frontier. The can then be extracted through such Numerical results comparing our method approaches classes, including knapsack, covering, traveling salesperson (TSP), suggest runtime speed-ups exactly especially when functions grows.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Network Models for Multiobjective Discrete Optimization

This paper provides a novel framework for solving multiobjective discrete optimization problems with an arbitrary number of objectives. Our framework formulates these problems as network models, in that enumerating the Pareto frontier amounts to solving a multicriteria shortest path problem in an auxiliary network. We design tools and techniques for exploiting the network model in order to acce...

متن کامل

Multiobjective Optimization using GAI Models

This paper deals with multiobjective optimization in the context of multiattribute utility theory. The alternatives (feasible solutions) are seen as elements of a product set of attributes and preferences over solutions are represented by generalized additive decomposable (GAI) utility functions modeling individual preferences or criteria. Due to decomposability, utility vectors attached to sol...

متن کامل

An Exact Method for a Discrete Multiobjective Linear Fractional Optimization

Integer linear fractional programming problem with multiple objective MOILFP is an important field of research and has not received as much attention as did multiple objective linear fractional programming. In this work, we develop a branch and cut algorithm based on continuous fractional optimization, for generating the whole integer efficient solutions of the MOILFP problem. The basic idea of...

متن کامل

Multiobjective Optimisation on Network Models

A specification, formulisation and implementation for multiobjective optimised route planning on a transport network is described. Transportation problem search spaces are large and often complex, involving many (independent) variables. Travellers often settle for any journey specification satisfying some weak set of conditions. The approach described provides provably optimal journey specifica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Informs Journal on Computing

سال: 2022

ISSN: ['1091-9856', '1526-5528']

DOI: https://doi.org/10.1287/ijoc.2021.1066